Measuring Timing Errors in FPGA-based Circuits

نویسندگان

  • Joshua Levine
  • Edward Stott
  • Nachiket Kapre
چکیده

FPGA-based platforms offer a unique and challenging platform for implementation of circuit-level timing-error detection and correction logic. If we operate FPGA designs beyond the conservative margins identified by the CAD tools, we can deliver substantial energy and performance improvements. In this paper we develop a strategy for monitoring timing errors in streaming FPGA circuits based on Razor-like shadow register insertion. Through a combination of careful calibration, hold timing control, critical path sampling and adaptation of the CAD flow, we design a robust, trustworthy error detection methodology for FPGA-based circuits. Our scheme can detect timing errors to deliver 39% energy reductions and 62% throughput improvements for the floating-point single-precision multiplier circuit with negligible overhead.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Architecture and Simulation of Timing Synchronization Circuits for the FPGA Implementation of Narrowband Waveforms

This paper describes the architecture, design flow and verification process for the FPGA implementation of timing recovery circuits for QAM waveforms. We achieve sample timing alignment by phase selection of a polyphase matched filter. The challenge in realizing these circuits in hardware is not in the construction of the multirate filter architecture, but rather the complex control circuitry t...

متن کامل

مدل عملکردی تحلیلی FPGA برای پردازش با قابلیت پیکربندی مجدد

Optimizing FPGA architectures is one of the key challenges in digital design flow. Traditionally, FPGA designers make use of CAD tools for evaluating architectures in terms of the area, delay and power. Recently, analytical methods have been proposed to optimize the architectures faster and easier. A complete analytical power, area and delay model have received little attention to date. In addi...

متن کامل

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

متن کامل

High-Level Synthesis of In-Circuit Assertions for Verification, Debugging, and Timing Analysis

Despite significant performance and power advantages compared to microprocessors, widespread usage of FPGAs has been limited by increased design complexity. High-level synthesis (HLS) tools have reduced design complexity but provide limited support for verification, debugging, and timing analysis. Such tools generally rely on inaccurate software simulation or lengthy registertransfer-level simu...

متن کامل

MONTAGNE: An FPL for Synchronous and Asynchronous Circuits

Field-programmable gate arrays are frequently used to implement system interfaces and glue logic. However, there has been little attention given to the special problems of these types of circuits in FPGA architectures. In this paper we describe Montage, a Triptych-based FPGA designed for implementing asynchronous logic and interfacing separately-clocked synchronous circuits. Asynchronous circui...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014